Weighted Path Orders Are Semantic Path Orders

Abstract We explore the relationship between weighted path orders and (monotonic) semantic orders. Our findings reveal that can be considered instances of a variant comprise order pairs. This observation leads to generalization does not impose simplicity on their underlying algebras. As result, generalized version is capable proving termination term rewrite systems beyond realm simple termination. In assess practicality we provide experimental data comparing with original ones as well other well-known classes reduction